New results on Pseudo-triangulations with low vertex degree
نویسنده
چکیده
We show that it is NP-hard to decide if a geometric graph can be extended to a pseudo-triangulation by adding lines and not violating a given degree bound. The equivalent problem for triangulations is known to be NP-hard if we ask for a triangulation with maximum vertex degree 7 [3]. We show that finding a pseudotriangulations is already NP-complete if we forbid vertex degrees greater than 5. The problem stays NPcomplete for pointed pseudo-triangulations. As a second result we show that point sets with uniformly distributed convex layers allow a pseudo-triangulation with low degree and face bound.
منابع مشابه
Degree Bounds for Constrained Pseudo-Triangulations
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.
متن کاملFlip Graphs of Degree-Bounded (Pseudo-)Triangulations⋆
We study flip graphs of (pseudo-)triangulations whose maximum vertex degree is bounded by a constant k. In particular, we consider (pseudo-)triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6; the diameter of the flip graph is O(n). We also show that for general point sets flip graphs of minimum pseudo-triangulatio...
متن کاملTight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in general position has a minimum pseudo-triangulation whose maximum face degree is four (i.e. each interior face of this pseudo-triangulation has at most four vertices). Both degree bounds are tight. Minimum pseudo-trian...
متن کاملAllocating Vertex π - Guards in Simple Polygons via Pseudo - Triangulations ∗
We use the concept of pointed pseudo-triangulations to establish new upper and lower bounds on a well known problem from the area of art galleries: What is the worst case optimal number of vertex π -guards that collectively monitor a simple polygon with n vertices? Our results are as follows: 1. Any simple polygon with n vertices can be monitored by at most n/2 general vertex π -guards. This bo...
متن کاملParity-Constrained Triangulations with Steiner Points
Let P ⊂ R be a set of n points, of which k lie in the interior of the convex hull CH(P) of P . Let us call a triangulation T of P even (odd) if and only if all its vertices have even (odd) degree, and pseudo-even (pseudo-odd) if at least the k interior vertices have even (odd) degree. On the one hand, triangulations having all its interior vertices of even degree have one nice property; their v...
متن کامل